Address book

Contacts

Staff Structures

MARCO DI SUMMA

Back to the list

Position

Professore Ordinario

Structure

Dipartimento di Matematica "Tullio Levi-Civita" - DM

Address

VIA TRIESTE, 63 - TORRE ARCHIMEDE - PADOVA

Telephone

0498271348

E-mail

marco.disumma@unipd.it

Notices

Office hours

  • Thursday from 14:30 to 16:00
    at Torre Archimede, ufficio 414.
    L'orario di ricevimento si riferisce al solo periodo di lezione. Fuori dal periodo di lezione, si prega di contattare il docente per e-mail.

Teachings

Publications

(Only the recent publications are listed.)

A. Basu, M. Conforti, M. Di Summa, J. Paat, The structure of the infinite models in integer programming, Proceedings of IPCO 2017, pp. 63-74, Springer (2017).

A. Basu, M. Conforti, M. Di Summa, J. Paat, Extreme functions with an arbitrary number of slopes, Mathematical Programming, published online (2017).

A. Basu, M. Conforti, M. Di Summa, J. Paat, Extreme functions with an arbitrary number of slopes, Proceedings of IPCO 2016, pp. 190-201, Springer (2016).

M. Conforti, M. Di Summa, Maximal S-free convex sets and the Helly number, SIAM Journal on Discrete Mathematics 30, pp. 2206-2216 (2016).

M. Di Summa, A. Lucchini, The swap graph of the finite soluble groups, Journal of Algebraic Combinatorics 44, pp. 447-454 (2016).

A. Basu, M. Conforti, M. Di Summa, A geometric approach to cut-generating functions, Mathematical Programming 151, pp. 153-189 (2015).

M. Di Summa, F. Eisenbrand, Y. Faenza, C. Moldenhauer, On largest volume simplices and sub-determinants, Proceedings of SODA 2015, pp. 315-323 (2015).

M. Di Summa, A short convex hull proof for the all-different system with the inclusion property, Operations Research Letters 43, pp.69-73 (2015)

R. Aringhieri, D. Catanzaro, M. Di Summa, R. Pesenti, A branch-price-and-cut algorithm for the Minimum Evolution Problem, European Journal of Operational Research 244, pp. 753-765 (2015).

M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, Reverse split rank, Mathematical Programming 154, pp. 273-303 (2015).

M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, R. Grappe, Reverse Chvátal-Gomory rank, SIAM Journal on Discrete Mathematics 29, pp. 166-181 (2015).

M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, Reverse split rank, Proceedings of IPCO 2014, pp. 234-248, Springer (2014).

M. Di Summa, D. Pritchard, L. Sanità, Finding the closest ultrametric, Discrete Applied Mathematics 180, pp. 70-80 (2015).

N. Bonifas, M. Di Summa, F. Eisenbrand, N. Hähnle, M. Niemeier, On sub-determinants and the diameter of polyhedra, Discrete & Computational Geometry 52, pp. 102-115 (2014).

M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, R. Grappe, Reverse Chvátal-Gomory rank, Proceedings of IPCO 2013, pp. 133-144, Springer (2013).

B. Addis, M. Di Summa, A. Grosso, Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth, Discrete Applied Matehmatics 161, pp. 2349-2360 (2013).

G. Averkov, M. Conforti, A. Del Pia, M. Di Summa, Y. Faenza, On the convergence of the affine hull of the Chvátal-Gomory closures, SIAM Journal on Discrete Mathematics 27, pp. 1492-1502 (2013).

N. Bonifas, M. Di Summa, F. Eisenbrand, N. Hähnle, M. Niemeier, On sub-determinants and the diameter of polyhedra, Proceedings of SoCG'12, pp. 357-362, ACM (2012).

M. Di Summa, A. Grosso, M. Locatelli, Branch and cut algorithms for detecting critical nodes in undirected graphs, Computational Optimization and Applications 53, pp. 649-680 (2012).

M. Di Summa, L. A. Wolsey, Mixing sets linked by bidirected paths, SIAM Journal on Optimization 21, pp. 1594-1613 (2011).

M. Di Summa, A. Grosso, M. Locatelli, Complexity of the critical node problem over trees, Computers & Operations Research 38, pp. 1766-1774 (2011).

R. Aringhieri, D. Catanzaro, M. Di Summa, Optimal solutions for the Balanced Minimum Evolution Problem, Computers & Operations Research 38, pp. 1845-1854 (2011).